Steve Kremer and Laurent Mazaré Adaptive Soundness of Static Equivalence
نویسندگان
چکیده
We define a framework to reason about sound implemen-tations of equational theories in the presence of an adap-tive adversary. In particular, we focus on soundess of staticequivalence. We illustrate our framework on several equa-tional theories: symmetric encryption, XOR, modular expo-nentiation and also joint theories of encryption and modu-lar exponentiation as well as encryption and XOR. For thelast two examples we use a proof technique that enables usto reuse proofs for the separate theories. Finally, we de-fine a model for symbolic analysis of dynamic group keyexchange protocols, and show its computational soundness.
منابع مشابه
Adaptive Soundness of Static Equivalence
We define a framework to reason about implementations of equational theories in the presence of an adaptive adversary. We particularly focus on soundess of static equivalence. We illustrate our framework on different equational theories: symmetric encryption, modular exponentiation and also joint theories of encryption and modular exponentiation. Finally, we define a model for symbolic analysis...
متن کاملComputational soundness of static equivalence
Privacy related properties in electronic voting are naturally expressed as indistinguishability properties. This motivates the study of observational equivalence, as well as static equivalence in the context of the AVOTÉ project. In this report we survey the existing results on the computational soundness of symbolic indistinguishability relations in the presence of a passive adversary, for whi...
متن کاملComputationally Sound Implementations of Equational Theories Against Passive Adversaries
In this paper we study the link between formal and cryptographic models for security protocols in the presence of passive adversaries. In contrast to other works, we do not consider a fixed set of primitives but aim at results for arbitrary equational theories. We define a framework for comparing a cryptographic implementation and its idealization with respect to various security notions. In pa...
متن کاملComputational Soundness of Symbolic Models for Cryptographic Protocols Supervised by Yassine Lakhnech JURY
متن کامل
RAPPORT TECHNIQUE PROUVÉ Retour d’Expérience sur la Validation du Vote Électronique
Electronic voting promises the possibility of a convenient, efficient and secure facility for recording and tallying votes in an election. Recently highlighted inadequacies of implemented systems have demonstrated the importance of formally verifying the underlying voting protocols. The applied pi calculus is a formalism for modelling such protocols, and allows us to verify properties by using ...
متن کامل